Formalization and Implementation of Modern SAT Solvers
نویسندگان
چکیده
منابع مشابه
Modern Parallel SAT-Solvers
This paper surveys modern parallel SAT-solvers. It focusses on recent successful techniques and points out weaknesses that have to be overcome to exploit the full power of modern multi-core processors.
متن کاملGeneric CDCL - A Formalization of Modern Propositional Satisfiability Solvers
Modern propositional satisfiability (or SAT) solvers are very powerful due to recent developments on the underlying data structures, the used heuristics to guide the search, the deduction techniques to infer knowledge, and the formula simplification techniques that are used during preand inprocessing. However, when all these techniques are put together, the soundness of the combined algorithm i...
متن کاملEmpirical Study of the Anatomy of Modern Sat Solvers
Boolean Satisfiability (SAT) solving has dramatically evolved in the past decade and a half. The outcome, today, is manifested in dozens of high performance and relatively scalable SAT solvers. The significant success of SAT solving technology, specially on practical problem instances, is credited to the aggregation of different SAT enhancements. In this paper, we revisit the organization of mo...
متن کاملPatching MiniSat to Deliver Performance of Modern SAT Solvers
COMiniSatPS is a patched MiniSat generated by applying a series of small diff patches to the last available version (2.2.0) of MiniSat that was released several years ago. The essence of the patches is to include only minimal changes necessary to make MiniSat sufficiently competitive with modern SAT solvers. One important goal of COMiniSatPS is to provide these changes in a highly accessible an...
متن کاملPredicting Learnt Clauses Quality in Modern SAT Solvers
Beside impressive progresses made by SAT solvers over the last ten years, only few works tried to understand why Conflict Directed Clause Learning algorithms (CDCL) are so strong and efficient on most industrial applications. We report in this work a key observation of CDCL solvers behavior on this family of benchmarks and explain it by an unsuspected side effect of their particular Clause Lear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Automated Reasoning
سال: 2009
ISSN: 0168-7433,1573-0670
DOI: 10.1007/s10817-009-9127-8